A convex relaxation approach for power flow problem
نویسندگان
چکیده
منابع مشابه
A Convex Relaxation Approach to the Affine Subspace Clustering Problem
Abstract. Prototypical data clustering is known to su↵er from poor initializations. Recently, a semidefinite relaxation has been proposed to overcome this issue and to enable the use of convex programming instead of ad-hoc procedures. Unfortunately, this relaxation does not extend to the more involved case where clusters are defined by parametric models, and where the computation of means has t...
متن کاملConvex Relaxation of Optimal Power Flow - Part II: Exactness
This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact. Citation: I...
متن کاملBiogeography Based Optimization Approach for Solving Optimal Power Flow Problem
This paper presents the use of a novel evolutionary algorithm called Biogeography-based optimization (BBO) for the solution of the optimal power flow problem. The objective is to minimize the total fuel cost of generation and environmental pollution caused by fossil based thermal generating units and also maintain an acceptable system performance in terms of limits on generator real and reactiv...
متن کاملFlow shop Scheduling Problem with Maintenance Coordination: a New Approach
This study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. The problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. The time interval between consecutive maintenance activities as well as the...
متن کاملBranch Flow Model for Radial Networks: Convex Relaxation
Power flow optimization is generally nonlinear and non-convex, and a second-order cone relaxation has been proposed recently for convexification. We prove several sufficient conditions under which the relaxation is exact. One of these conditions seems particularly realistic and suggests guidelines on integrating distributed generations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Modern Power Systems and Clean Energy
سال: 2019
ISSN: 2196-5625,2196-5420
DOI: 10.1007/s40565-019-0525-6